New Developments in Iterated Rounding∗
نویسنده
چکیده
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity has led to several remarkable new results and also simpler proofs of many previous results. We will briefly survey some applications of the method, including some recent developments and giving a high level overview of the ideas. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Robust Geometric Computing and Optimal Visibility Coverage
1 2 Preface This book presents work in two of the most popular areas of geometric computation: Robust Geometric Computing and Optimal Visibility Coverage. Both areas have been extensively researched in recent years and attracted the attention of many researchers and developers in both the academic and the industrial worlds. The work we present here aims to contribute to this effort by providing...
متن کاملA Note on Iterated Rounding for the Survivable Network Design Problem
In this note we consider the survivable network design problem (SNDP) in undirected graphs. We make two contributions. The first is a new counting argument in the iterated rounding based 2-approximation for edge-connectivity SNDP (EC-SNDP) originally due to Jain [10]. The second contribution is to make some connections between hypergraphic version of SNDP (Hypergraph-SNDP) introduced in [17] an...
متن کاملApproximation-Friendly Discrepancy Rounding
Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative rounding. We provide an extension of the discrepancy-based rounding algorithm due to Lovett-Meka that (i) combines the advantages of both randomized and iterat...
متن کاملExtending the Power of Snap Rounding Variants
Snap Rounding (SR for short) is a method for converting arbitrary-precision arrangements of line segments into a fixed-precision representation. In the previous years two variants of SR were presented: Iterated Snap Rounding (ISR) and Iterated Snap Rounding with Bounded Drift (ISRBD). Their goal was to eliminate an undesirable property that SR possesses. Prior to their appearances, the capabili...
متن کاملA New Approximation Technique for Resource-Allocation Problems
We develop a rounding method based on random walks in polytopes, which leads to improved approximation algorithms and integrality gaps for several assignment problems that arise in resource allocation and scheduling. In particular, it generalizes the work of Shmoys & Tardos on the generalized assignment problem in two different directions, where the machines have hard capacities, and where some...
متن کامل